Extensional Models of Typed Lambda-mu Calculus
نویسنده
چکیده
This paper shows that the stream models of Nakazawa and Katsumata can be adapted to a typed setting for an extension of the Λμcalculus, called Λμcons. It shows the typed Λμcons is sound and complete with respect to the stream models. It also shows that any individual stream model with whole function spaces and infinite bases characterizes the extensional equality. This result corresponds to Friedman’s theorem for the simply-typed λ-calculus and the full type hierarchies.
منابع مشابه
Extensional Models of Untyped Lambda-mu Calculus
This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called the stream combinatory algebra, which is an extension of the combinatory algebra, and it is proved that the extensional equality of the Lambda...
متن کاملExtensional Models for Polymorphism
We present a general method for constructing extensional models for the Girard-Reynolds polymorphic lambda calculus the polymorphic extensional collapse. The method yields models that satisfy additional, computationally motivated constraints like having only two polymorphic booleans and having only the numerals as polymorphic integers. Moreover, the method can be used to show that any simply ty...
متن کاملParallel PCF Has a Unique Extensional Model
We show that the continuous function model is the unique extensional (but not necessarily pointwise ordered) model of the variant of the applied typed lambda calculus PCF that includes the \parallel or" operation.
متن کاملDenotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with control flow operators. Using an enriched version of the Yoneda embedding, we obtain a categorical normal form function for simply typed lambda-mu terms, which gives a special kind of a call-by-name denotational semantics particularly useful for deciding equalities in the lambda-mu calculus.
متن کاملHigher-Order Uni cation via Combinators
We present an algorithm for uniication in the simply typed lambda calculus which enumerates complete sets of uniiers using a nitely branching search space. In fact, the types of terms may contain type-variables, so that a solution may involve type-substitution as well as term-substitution. the problem is rst translated into the problem of uniication with respect to extensional equality in combi...
متن کامل